ar X iv : q ua nt - p h / 03 11 06 0 v 1 1 0 N ov 2 00 3 On the power of Ambainis ’ s lower bounds ∗
نویسنده
چکیده
The polynomial method and Ambainis’s lower bound method are two main quantum lower bound techniques. Recently Ambainis showed that the polynomial method is not tight. The present paper aims at studying the limitation of Ambainis’s lower bounds. We first give a generalization of the three known Ambainis’s lower bound theorems. Then it is shown that all these four Ambainis’s lower bounds have an upper bound, which is in terms of certificate complexity. This implies that for some problems such as TRIANGLE, k-CLIQUE, and BIPARTITE/GRAPH MATCHING whose quantum query complexities are still open, the best known lower bounds cannot be further improved by using Ambainis’s techniques. Another consequence is that all the Ambainis’s lower bounds are not tight. Finally, we show that for total functions, this upper bound for Ambainis’s lower bounds can be further improved. This also implies limitation of Ambainis’s method on some specific problems such as AND-OR TREE, whose precise quantum complexity is still unknown.
منابع مشابه
ar X iv : q ua nt - p h / 04 11 17 2 v 1 2 3 N ov 2 00 4 Information and Entropy in Quantum Theory
متن کامل
ar X iv : q ua nt - p h / 06 11 05 0 v 1 6 N ov 2 00 6 The computational complexity of PEPS
We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows to solve PP problems, the latter two tasks are both proven to be #P-complete. We further show how PEPS can be used to approximate ground states of gapped Hamilto...
متن کاملar X iv : q ua nt - p h / 06 11 18 7 v 1 1 7 N ov 2 00 6 Philosophical Aspects of Quantum Information Theory
2 First steps with quantum information 3 2.1 Bits and qubits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 The no-cloning theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Quantum cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.3.1 Key Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Entanglement-as...
متن کاملar X iv : q ua nt - p h / 03 11 03 6 v 1 6 N ov 2 00 3 1 Quantum Boolean Summation with Repetitions in the Worst - Average Setting ⋆
We study the quantum summation (QS) algorithm of Brassard, Høyer, Mosca and Tapp, see [1], which approximates the arithmetic mean of a Boolean function defined on N elements. We present sharp error bounds of the QS algorithm in the worst-average setting with the average performance measured in the Lq norm, q ∈ [1,∞]. We prove that the QS algorithm with M quantum queries, M < N , has the worst-a...
متن کاملar X iv : q ua nt - p h / 06 03 00 8 v 2 2 1 Ju n 20 06 ON POSITIVE DECOMPOSABLE MAPS
A partial characterization (a necessary condition for decompos-ability and a criterion for nondecomposability) of decomposable positive maps is given. Furthermore, a clarification of the structure of the set of positive maps is provided.
متن کامل